Adaptive scenario subset selection for worst-case optimization and its application to well placement optimization

نویسندگان

چکیده

In this study, we consider simulation-based worst-case optimization problems with continuous design variables and a finite scenario set. To reduce the number of simulations required increase restarts for better local optimum solutions, propose new approach referred to as adaptive subset selection (AS3). The proposed subsamples support construct objective function in given neighborhood, introduce such subset. Moreover, develop algorithm by combining AS3 covariance matrix adaptation evolution strategy (CMA-ES), denoted AS3-CMA-ES. At each algorithmic iteration, scenarios is selected, CMA-ES attempts optimize computed only through scenarios. reduces executing on subset, rather than all numerical experiments, verified that AS3-CMA-ES more efficient terms brute-force surrogate-assisted lq-CMA-ES when ratio total relatively small. addition, usefulness was evaluated well placement carbon dioxide capture storage (CCS). comparison lq-CMA-ES, able find solutions because frequent restarts.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Crash Hedging Strategies and Worst–Case Scenario Portfolio Optimization

Crash hedging strategies are derived as solutions of non–linear differential equations which itself are consequences of an equilibrium strategy which make the investor indifferent to uncertain (down) jumps. This is done in the situation where the investor has a logarithmic utility and where the market coefficients after a possible crash may change. It is scrutinized when and in which sense the ...

متن کامل

Worst-Case Scenario Portfolio Optimization: a New Stochastic Control Approach

We consider the determination of portfolio processes yielding the highest worst-case bound for the expected utility from final wealth if the stock price may have uncertain (down) jumps. The optimal portfolios are derived as solutions of non-linear differential equations which itself are consequences of a Bellman principle for worst-case bounds. A particular application of our setting is to mode...

متن کامل

Well Placement Optimization Using Differential Evolution Algorithm

Determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. It is a computationally intensive task due to the large number of simulation runs required. Therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum numbe...

متن کامل

Subset Selection by Pareto Optimization

Selecting the optimal subset from a large set of variables is a fundamental problem in various learning tasks such as feature selection, sparse regression, dictionary learning, etc. In this paper, we propose the POSS approach which employs evolutionary Pareto optimization to find a small-sized subset with good performance. We prove that for sparse regression, POSS is able to achieve the best-so...

متن کامل

Ant Colony Optimization for Feature Subset Selection

The Ant Colony Optimization (ACO) is a metaheuristic inspired by the behavior of real ants in their search for the shortest paths to food sources. It has recently attracted a lot of attention and has been successfully applied to a number of different optimization problems. Due to the importance of the feature selection problem and the potential of ACO, this paper presents a novel method that ut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Soft Computing

سال: 2023

ISSN: ['1568-4946', '1872-9681']

DOI: https://doi.org/10.1016/j.asoc.2022.109842